Structure of repeated-root constacyclic codes of length3psand their duals
نویسندگان
چکیده
منابع مشابه
Repeated-root constacyclic codes of length slmpn
For any different odd primes ` and p, structure of constacyclic codes of length 2`p over the finite field Fq of characteritic p and their duals is established in term of their generator polynomials. Among other results, the characterization and enumeration of all linear complimentary dual and self-dual constacylic codes of length 2`p are obtained.
متن کاملRepeated-root constacyclic codes of length $2\ell^mp^n$
For any different odd primes l and p, structure of constacyclic codes of length 2lp over a finite field Fq of characteritic p and their duals is established in term of their generator polynomials. Among other results, all linear complimentary dual and self-dual constacyclic codes of length 2lp over Fq are obtained.
متن کاملMatrix-product structure of repeated-root constacyclic codes over finite fields
For any prime number p, positive integers m, k, n satisfying gcd(p, n) = 1 and λ0 ∈ F × pm, we prove that any λ p 0 -constacyclic code of length p n over the finite field Fpm is monomially equivalent to a matrix-product code of a nested sequence of p λ0-constacyclic codes with length n over Fpm.
متن کاملA note on the duals of skew constacyclic codes
Let Fq be a finite field with q elements and denote by θ : Fq → Fq an automorphism of Fq. In this note, we deal with skew constacyclic codes, i.e. linear codes of Fnq which are invariant under the action of a semi-linear map T : Fnq → F n q , defined by T (a0, ..., an−2, an−1) := (αan−1, a0, ..., an−2) for some α ∈ Fq −{0} and n ≥ 2. In particular, we study some algebraic and geometric properti...
متن کاملPolycyclic codes over Galois rings with applications to repeated-root constacyclic codes
Cyclic, negacyclic and constacyclic codes are part of a larger class of codes called polycyclic codes; namely, those codes which can be viewed as ideals of a factor ring of a polynomial ring. The structure of the ambient ring of polycyclic codes over GR(p,m) and generating sets for its ideals are considered. It is shown that these generating sets are strong Groebner bases. A method for finding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2013
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.01.024